G’3-Stable Semantics and Inconsistency Semantica G3'-Estable e Inconsistencia

نویسندگان

  • Mauricio Osorio
  • Claudia Zepeda
  • Juan Carlos Nieves
  • José Luis Carballido
چکیده

We present an overview on how to perform non-monotonic reasoning based on paraconsistent logics. In particular, we show that one can define a logic programming semantics based on the paraconsistent logic G’3 which is called G’3-stable semantics. This semantics defines a frame for performing non-monotonic reasoning in domains which are pervaded with vagueness and inconsistencies. In fact, we show that, by considering also a possibilistic logic point of view, one can use this extended framework for defining a possibilistic logic programming approach able to deal with reasoning, which is at the same time non-monotonic and uncertain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Panta Rei: Tracking Semantic Change with Distributional Semantics in Ancient Greek

English. We present a method to explore semantic change as a function of variation in distributional semantic spaces. In this paper we apply this approach to automatically identify the areas of semantic change in the lexicon of Ancient Greek between the pre-Christian and Christian era. Distributional Semantic Models are used to identify meaningful clusters and patterns of semantic shift within ...

متن کامل

Verso L’analisi Statica Degli Answer Set Programs towards Static Analysis of Answer Set Programs1

In questo lavoro viene proposto un metodo di analisi statica per l’“Answer Set Programming”, che é un nuovo paradigma basato sulla semantica degli “answer sets” introdotta da Gelfond e Lifschitz (chiamata anche semantica dei “modelli stabili”). Il metodo si basa sui seguenti punti: identificare i cicli che compaiono in un programma, mostrando che i modelli stabili del programma stesso si posson...

متن کامل

On the decidability of FDNC programs

Il Milione: A Journey in the Computational Logic in Italy 55 SOMMARIO/ABSTRACT Questo articolo introduce una nuova dimostrazione della decidibilità del controllo di consistenza per i programmi FDNC sotto la semantica dei modelli stabili, basandosi su splitting sequences regolari. Con questa tecnica, riusciamo a rilassare leggermente la definizione di programmi FDNC e muoviamo un primo passo ver...

متن کامل

The ESTEEM Architecture for Emergent Semantics and Cooperation in MultiKnowledge Environments

Questo documento costituisce il deliverable DALL2 del progetto Esteem e ha lo scopo di illustrare l’architettura complessiva di un peer Esteem. Tale architettura è stata sviluppata nel corso del progetto con il contributo di tutti i partner e presenta una struttura modulare. In particolare, nel documento, viene fornita una descrizione dei vari componenti dell’architettura e, per ognuno di essi,...

متن کامل

N'5 as an Extension of G'3

We present an extension of GLukG, a logic that was introduced in [6] as a three-valued logic under the name of G3. GLukG is a paraconsistent logic defined in terms of 15 axioms, which serves as the formalism to define the p-stable semantics of logic programming. We introduce a new axiomatic system, N-GLukG, a paraconsistent logic that possesses strong negation. We use the 5-valued logic N ′ 5, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009